Scheduling subject to resource constraints: classification and complexity
نویسندگان
چکیده
منابع مشابه
Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints
The problem of scheduling a set of unit-time jobs on M uniform machines is studied. Some jobs may require a unit of an additional single resource during their execution. The resource is renewable but the total resource consumption is limited by the same value at each time instant. The objective is to find a feasible schedule minimizing the maximum job completion time. We show that an approach s...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملSingle machine scheduling problems with financial resource constraints: Some complexity results and properties
We consider single machine scheduling problems with a non-renewable resource. This type of problems has not been intensively investigated in the literature so far. For several problems of this type with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity results. Particu...
متن کاملCompile-time scheduling with resource-constraints
Most tasks in DSP-applications require multiple resources for their execution. If only CPU-usage is considered while constructing a static schedule, the actual run-time performance of the application can differ a lot from the predicted one. In this paper we present a scheduling method that takes non-CPU resourcerequirements into account as well while constructing the static schedule. Situation ...
متن کاملBounds for Multiprocessor Scheduling with Resource Constraints
One well-studied model of a multiprocessing system involves a fixed number n of identical abstract processors, a finite set of tasks to be executed, each requiring a specified amount of computation time, and a partial ordering on the tasks which requires certain tasks to be completed before certain others can be initiated. The nonpreemptive operation of the system is guided by an ordered list L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1983
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90012-4